Evaluating Parallel R-Tree Implementations on a Network of Workstations
نویسندگان
چکیده
Several GIS applications are characterized by the vast amount of information that needs to be stored, retrieved and analyzed. The volume and complexity of the data will continue to grow in the future as is apparent from the expected geo-spatial petabyte data set for NASA’s EOSDIS project which will hold a collection of raster images arriving at a rate of 3-5 Mbytes/second for 10 years from satellites orbiting the earth. In addition to just being able to handle these large data sets, a GIS should also be able to perform queries on this data efficiently to meet certain real-time constraints. Queries to a GIS are not necessarily limited to spatial searches or selections. The response times for all queries should be maintained as low as possible. To summarize, there are are three main requirements for a GIS to be successful in handling the demands of current and emerging applications:
منابع مشابه
Distributed P trticle-Mesh Ewald: A Parallel Ewald Summation Method
The Distributed Particle-Mesh Ewald method (DPME) is a parallel Ewald summation method that is based on the O(NlogN) PME method for evaluating the electrostatic interactions of a periodic particle system, where N is the number of particles in the unit cell. We present three implementations of the DPME method which are evaluated on a network of workstations and the Cray T3D. The performance of t...
متن کاملEfficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields
This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) by irreducible pentanomials and trinomials. The architecture of the first multiplier is based on a parallel and independent computation of powers of the polynomial variable. In the second structure only even powers of the polynomial variable are used. The par...
متن کاملAn Evaluation of Message Passing Implementations on Beowulf Workstations
Beowulf workstations have become a popular choice for high-end computing in a number of application domains. One of the key building blocks of parallel applications on Beowulf workstations is a message passing library. While there are message passing library implementations available for use on Beowulf workstations, as of yet none have been specifically tailored to this new, unique architecture...
متن کاملBranch-and-bound parallelization strategies applied to a depot location and container fleet management problem
This paper presents branch-and-bound parallelization strategies applied to the location/ allocation problem with balancing requirements. This formulation is representative of a larger class of discrete network design and location problems arising in many transportation logistics and telecommunications applications: it displays a multicommodity network ̄ow structure and a complex objective funct...
متن کاملTREE-PUZZLE: maximum likelihood phylogenetic analysis using quartets and parallel computing
SUMMARY TREE-PUZZLE is a program package for quartet-based maximum-likelihood phylogenetic analysis (formerly PUZZLE, Strimmer and von Haeseler, Mol. Biol. Evol., 13, 964-969, 1996) that provides methods for reconstruction, comparison, and testing of trees and models on DNA as well as protein sequences. To reduce waiting time for larger datasets the tree reconstruction part of the software has ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998